A Novel Algorithm for Distance Transformation on Irregular Isothetic Grids
نویسندگان
چکیده
In this report, we propose a new definition of the EDT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute this transformation on every grids, which is independent of the background representation. We show that our proposal is able to efficiently handle various kind of classical irregular two-dimensional grids in imagery, and that it can be easily extended to higher dimensions.
منابع مشابه
Distance Transformation on Two-Dimensional Irregular Isothetic Grids
In this article, we propose to investigate the extension of the SEDT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We give two algorithms to handle different structurations of grids. We first describe a simple approach based on the complete Voronoi diagram of the background irregular pixels, very fast on sparse grids. Then, we extend the separable algorithm defined o...
متن کاملSpecial Issue: Discrete Geometry for Computer Imagery Supercover model, digital straight line recognition and curve reconstruction on the irregular isothetic grids
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested in a discrete geometry on irregular grids. More precisely, our goal is to define geometrical properties on irregular isothetic grids that are tilings of the Euclidean plane with different sized axis parallel rectangles....
متن کاملSeparable algorithms for distance transformations on irregular grids
In this article, we propose to investigate two extensions of the EDT (squared Euclidean Distance Transformation) on irregular isothetic grids (or I-grids), such as quadtree/octree or run-length encoded d-dimensional images. We enumerate the advantages and drawbacks of the I-CDT, based on the cell centres, and the ones of the I-BDT, which uses the cell borders. One of the main problem we mention...
متن کاملTopological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analysis, where images are digitized on (sometimes very-large scale) regular grids. Regardless of final application, we propose to first describe the topology of an irregular twodimensional object with its associated Reeb g...
متن کاملDynamic Reconstruction of Complex Planar Objects on Irregular Isothetic Grids
The vectorization of discrete regular images has been widely developed in many image processing and synthesis applications, where images are considered as a regular static data. Regardless of final application, we have proposed in [14] a reconstruction algorithm of planar graphical elements on irregular isothetic grids. In this paper, we present a dynamic version of this algorithm to control th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009